XPathMark: Functional and Performance Tests for XPath

نویسنده

  • Massimo Franceschet
چکیده

We present a major revision of the XPath benchmark known as XPathMark [1]. The new version splits into a functional test over a small educational document and a more elaborated performance test over XMark [2] documents. We conclude by sharing with the reader our experience on running XPathMark on some popular XSLT/XQuery processors. 1 Functional and Performance Tests for XPath The new release of XPathMark [3] consists of a functional and performance test for the XPath language version 1.0. 1.1 XPath Functional Test The main goal of XPath Functional Test (XPath-FT ) is testing completeness (which features of the language are supported?) and correctness (which features of the language are correctly implemented?) of an XML query processing system with respect to XPath 1.0. XPath-FT contains several groups of queries each covering a different functional aspect of the language including navigational axes, filters, node tests, operators and functions. The queries are interpreted over a small educational document and each query is accompanied with the correct answer. The skeleton of the target XML document, depicted in Figure 1, rapresents the English alphabet in such a way that the preorder traversal of the XML tree corresponds to the English alphabet sorted from A to Z. As an example of the query set, we report four queries in the axes group along with their answers in graphical format (see red nodes in Figure 2): A3 The descendant nodes of L (Answer: Figure 2 top-left) //L/descendant::* A5 The ancestor nodes of L (Answer: Figure 2 top-right) //L/ancestor::* A9 The following nodes of L (Answer: Figure 2 bottom-left) Dagstuhl Seminar Proceedings 06472 XQuery Implementation Paradigms http://drops.dagstuhl.de/opus/volltexte/2007/892

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

XPathMark: An XPath Benchmark for the XMark Generated Data

We propose XPathMark, an XPath benchmark on top of the XMark generated data. It consists of a set of queries which covers the main aspects of the language XPath 1.0. These queries have been designed for XML documents generated under XMark, a popular benchmark for XML data management. We suggest a methodology to evaluate the XPathMark on a given XML engine and, by way of example, we evaluate two...

متن کامل

XPathMark An XPath benchmark for XMark

We propose XPathMark, an XPath benchmark for XMark. It consists of a set of queries which covers the main aspects of the language XPath 1.0. These queries have been designed for XML documents generated under XMark, a popular benchmark for XML data management. We suggest a methodology to evaluate the XPath benchmark on a given XML engine and, by way of example, we evaluate two popular XML engine...

متن کامل

Early Nested Word Automata for XPath Query Answering on XML Streams

Algorithms for answering XPath queries on Xml streams have been studied intensively in the last decade. Nevertheless, there still exists no solution with high efficiency and large coverage. In this paper, we introduce early nested word automata in order to approximate earliest query answering algorithms for nested word automata in a highly efficient manner. We show that this approximation can b...

متن کامل

Scalable XML Query Processing using Parallel Pushdown Transducers

In online social networking, network monitoring and financial applications, there is a need to query high rate streams of XML data, but methods for executing individual XPath queries on streaming XML data have not kept pace with multicore CPUs. For data-parallel processing, a single XML stream is typically split into well-formed fragments, which are then processed independently. Such an approac...

متن کامل

Fast In-Memory XPath Search over Compressed Text and Tree Indexes

A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicates can efficiently be implemented using a compressed self-index of the document’s text nodes. Most queries, however, contain some parts of querying the text of the document, plus some parts of querying the tree structu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006